منابع مشابه
On Tree-Based Phylogenetic Networks
A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of ...
متن کاملTree-Based Unrooted Phylogenetic Networks
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is...
متن کاملTree-Based Unrooted Nonbinary Phylogenetic Networks
Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered ‘tree-like’ or not, which lead to the introduction of tree-based networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by...
متن کاملPhylogenetic networks that display a tree twice.
In the last decade, the use of phylogenetic networks to analyze the evolution of species whose past is likely to include reticulation events, such as horizontal gene transfer or hybridization, has gained popularity among evolutionary biologists. Nevertheless, the evolution of a particular gene can generally be described without reticulation events and therefore be represented by a phylogenetic ...
متن کاملLinear-Time Tree Containment in Phylogenetic Networks
We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaflabeled network contains a subdivision of a given leaf-labeled tree. We develop a fast algorithm for the case that the input network is indeed a tree in which multiple leaves might share a label. By combining this algorithm with a generalization of a previously know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2016
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2015.0228